On-line cursive letter recognition using sequences of local minima/maxima
نویسنده
چکیده
This report presents the design and implementation of an on-line cursive letter recognizer using sequences of local extrema. Recognition tests were performed on single writer's data. The results for top five alternatives exceeded 90% (Table 4). The matching is performed in three stages: • letter size normalisation (Figure 1); • limiting the recognition domain using sequences of local extrema and inexact matching (Figure 3) with a database; • evaluating the goodness of match for each element of the obtained limited recognition domain. Two methods of letter size normalisation were considered and tested: • uniform (Figure 1b); • non-uniform (Figure 1c). The uniform normalisation approach proved to be better (Figures 5, 6 and 7). Three different criteria are used for the last stage, resulting in three different " little recognizers " : • position of the local extrema (Figure 4a); • characteristic loci (Figure 4b); • loci angles (Figure 4c). The results of the three recognizers could be combined together in order to improve the recognition rate. The recognizer needs to be trained. The databases are built in two main stages: • creating the database of sequences of local extrema; • deriving detailed feature data for ranking the alternatives. The first stage is currently manual and may not lead to the best local extrema sequence database. The second stage can still need some supervision, depending on the specific extrema sequence database. The recognizer possesses a potential for incremental learning. At run time both new sequences of local extrema can be added, and the detailed features used for the ranking can be adjusted to better reflect a particular writing style. Further work is necessary: • tests with other writers' data; • conversion of the difference between patterns into the confidences of the match; • combination of results of different classifiers; • integration into the on-line cursive script recognition system, testing; • comparison with the existing letter recognizer using vector direction encoding.
منابع مشابه
Different method of extracting sequences of local minima/maxima for on-line cursive letter recognition
The mechanism of coping with co-linear horizontal or vertical points is depicted in Figure 2. When horizontal or vertical co-linear points are found, very little adjustments are applied to coordinates of the points. The adjustments are applied in such a way, that the polyline increases its “smoothness”. Three different cases can be distinguished: point of inflection (Figure 2a), real extremum (...
متن کاملUsing sequences of local minima/maxima for on-line cursive letter recognition
A recognition process is based on a comparison of an object to be identified (recognized) with objects known by the subject performing the recognition. In case of machine letter recognition this process is performed by a computer and software implemented on it and the objects to be recognized are letters. For on-line recognition letters are supplied as a set of consecutive coordinates of the pe...
متن کاملLow-Level Cursive Word Representation Based on Geometric Decomposition
An efficient low-level word image representation plays a crucial role in general cursive word recognition. This paper proposes a novel representation scheme, where a word image can be represented as two sequences of feature vectors in two independent channels, which are extracted from vertical peak points on the upper external contour and at vertical minima on the lower external contour, respec...
متن کاملPrecise Hand-printed Character Recognition Using Elastic Models via Nonlinear Transformation
Distorted character recognition is a difficult but inevitable problem in hand-printed character recognition. In this paper, we propose a character recognition method using elastic models for recognizing cursive characters with intricate structure. The models are fitted to unknown input patterns by applying the EM algorithm to minimize a measure of fittness. To avoid falling into local minima, m...
متن کاملNeural Network Learning Through Optimally Conditioned Quadratically Convergent Methods Requiring NO LINE SEARCH
Neural Network Learning algorithms based on Conjugate Gradient Techniques and Quasi Newton Techniques such as Broyden, DFP, BFGS, and SSVM algorithms require exact or inexact line searches in order to satisfy their convergence criteria. Line searches are very costly and slow down the learning process. This paper will present new Neural Network learning algorithms based on Hoshino's weak line se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993